17 research outputs found

    EECHS-ARO: Energy-efficient cluster head selection mechanism for livestock industry using artificial rabbits optimization and wireless sensor networks

    Get PDF
    In the livestock industry, wireless sensor networks (WSNs) play a significant role in monitoring many fauna health statuses and behaviors. Energy preservation in WSNs is considered one of the critical, complicated tasks since the sensors are coupled to constrained resources. Therefore, the clustering approach has proved its efficacy in preserving energy in WSNs. In recent studies, various clustering approaches have been introduced that use optimization techniques to improve the network lifespan by decreasing energy depletion. Yet, they take longer to converge and choose the optimal cluster heads in the network. In addition, the energy is exhausted quickly in the network. This paper introduces a novel optimization technique, i.e., an artificial rabbits optimization algorithm-based energy efficient cluster formation (EECHS-ARO) approach in a WSN, to extend the network lifetime by minimizing the energy consumption rate. The EECHS-ARO technique balances the search process in terms of enriched exploration and exploitation while selecting the optimal cluster heads. The experimentation was carried out on a MATLAB 2021a platform with varying sensor nodes. The obtained results of EECHS-ARO are contrasted with other existing approaches via teaching–learning based optimization algorithm (TLBO), ant lion optimizer (ALO) and quasi oppositional butterfly optimization algorithm (QOBOA). The proposed EECHS-ARO enriches the network lifespan by ~15% and improves the packet delivery ratio by ~5%

    Predicting Alzheimer’s Disease Using Deep Neuro-Functional Networks with Resting-State fMRI

    No full text
    Resting-state functional connectivity has been widely used for the past few years to forecast Alzheimer’s disease (AD). However, the conventional correlation calculation does not consider different frequency band features that may hold the brain atrophies’ original functional connectivity relationships. Previous works focuses on low-order neurodynamics and precisely manipulates the mono-band frequency span of resting-state functional magnetic imaging (rs-fMRI). They specifically use the mono-band frequency span of rs-fMRI, leaving out the high-order neurodynamics. By creating a high-order neuro-dynamic functional network employing several levels of rs-fMRI time-series data, such as slow4, slow5, and full-band ranges of (0.027 to 0.08 Hz), (0.01 to 0.027 Hz), and (0.01 to 0.08 Hz), we suggest an automated AD diagnosis system to address these challenges. It combines multiple customized deep learning models to provide unbiased evaluation, and a tenfold cross-validation is observed We have determined that to differentiate AD disorders from NC, the entire band ranges and slow4 and slow5, referred to as higher and lower frequency band approaches, are applied. The first method uses the SVM and KNN to deal with AD diseases. The second method uses the customized Alexnet and Inception blocks with rs-fMRI datasets from the ADNI organizations. We also tested the other machine learning and deep learning approaches by modifying various parameters and attained good accuracy levels. Our proposed model achieves good performance using three bands without any external feature selection. The results show that our system performance of accuracy (96.61%)/AUC (0.9663) is achieved in differentiating the AD subjects from normal controls. Furthermore, the good accuracies in classifying multiple stages of AD show the potentiality of our method for the clinical value of AD prediction

    Oppositional Pigeon-Inspired Optimizer for Solving the Non-Convex Economic Load Dispatch Problem in Power Systems

    No full text
    Economic Load Dispatch (ELD) belongs to a non-convex optimization problem that aims to reduce total power generation cost by satisfying demand constraints. However, solving the ELD problem is a challenging task, because of its parity and disparity constraints. The Pigeon-Inspired Optimizer (PIO) is a recently proposed optimization algorithm, which belongs to the family of swarm intelligence algorithms. The PIO algorithm has the benefit of conceptual simplicity, and provides better outcomes for various real-world problems. However, this algorithm has the drawback of premature convergence and local stagnation. Therefore, we propose an Oppositional Pigeon-Inspired Optimizer (OPIO) algorithm—to overcome these deficiencies. The proposed algorithm employs Oppositional-Based Learning (OBL) to enhance the quality of the individual, by exploring the global search space. The proposed algorithm would be used to determine the load demand of a power system, by sustaining the various equality and inequality constraints, to diminish the overall generation cost. In this work, the OPIO algorithm was applied to solve the ELD problem of small- (13-unit, 40-unit), medium- (140-unit, 160-unit) and large-scale (320-unit, 640-unit) test systems. The experimental results of the proposed OPIO algorithm demonstrate its efficiency over the conventional PIO algorithm, and other state-of-the-art approaches in the literature. The comparative results demonstrate that the proposed algorithm provides better results—in terms of improved accuracy, higher convergence rate, less computation time, and reduced fuel cost—than the other approaches

    Patron–Prophet Artificial Bee Colony Approach for Solving Numerical Continuous Optimization Problems

    No full text
    The swarm-based Artificial Bee Colony (ABC) algorithm has a significant range of applications and is competent, compared to other algorithms, regarding many optimization problems. However, the ABC’s performance in higher-dimension situations towards global optima is not on par with other models due to its deficiency in balancing intensification and diversification. In this research, two different strategies are applied for the improvement of the search capability of the ABC in a multimodal search space. In the ABC, the first strategy, Patron–Prophet, is assessed in the scout bee phase to incorporate a cooperative nature. This strategy works based on the donor–acceptor concept. In addition, a self-adaptability approach is included to balance intensification and diversification. This balancing helps the ABC to search for optimal solutions without premature convergence. The first strategy explores unexplored regions with better insight, and more profound intensification occurs in the discovered areas. The second strategy controls the trap of being in local optima and diversification without the pulse of intensification. The proposed model, named the PP-ABC, was evaluated with mathematical benchmark functions to prove its efficiency in comparison with other existing models. Additionally, the standard and statistical analyses show a better outcome of the proposed algorithm over the compared techniques. The proposed model was applied to a three-bar truss engineering design problem to validate the model’s efficacy, and the results were recorded

    Patron–Prophet Artificial Bee Colony Approach for Solving Numerical Continuous Optimization Problems

    No full text
    The swarm-based Artificial Bee Colony (ABC) algorithm has a significant range of applications and is competent, compared to other algorithms, regarding many optimization problems. However, the ABC’s performance in higher-dimension situations towards global optima is not on par with other models due to its deficiency in balancing intensification and diversification. In this research, two different strategies are applied for the improvement of the search capability of the ABC in a multimodal search space. In the ABC, the first strategy, Patron–Prophet, is assessed in the scout bee phase to incorporate a cooperative nature. This strategy works based on the donor–acceptor concept. In addition, a self-adaptability approach is included to balance intensification and diversification. This balancing helps the ABC to search for optimal solutions without premature convergence. The first strategy explores unexplored regions with better insight, and more profound intensification occurs in the discovered areas. The second strategy controls the trap of being in local optima and diversification without the pulse of intensification. The proposed model, named the PP-ABC, was evaluated with mathematical benchmark functions to prove its efficiency in comparison with other existing models. Additionally, the standard and statistical analyses show a better outcome of the proposed algorithm over the compared techniques. The proposed model was applied to a three-bar truss engineering design problem to validate the model’s efficacy, and the results were recorded

    OGWO-CH: Hybrid Opposition-Based Learning with Gray Wolf Optimization Based Clustering Technique in Wireless Sensor Networks

    No full text
    A Wireless Sensor Network (WSN) is a group of autonomous sensors that are distributed geographically. However, sensor nodes in WSNs are battery-powered, and the energy drainage is a significant issue. The clustering approach holds an imperative part in boosting the lifespan of WSNs. This approach gathers the sensors into clusters and selects the cluster heads (CHs). CHs accumulate the information from the cluster members and transfer the data to the base station (BS). Yet, the most challenging task is to select the optimal CHs and thereby to enhance the network lifetime. This article introduces an optimal cluster head selection framework using hybrid opposition-based learning with the gray wolf optimization algorithm. The hybrid technique dynamically trades off between the exploitation and exploration search strategies in selecting the best CHs. In addition, the four different metrics such as energy consumption, minimal distance, node centrality and node degree are utilized. This proposed selection mechanism enhances the network efficiency by selecting the optimal CHs. In addition, the proposed algorithm is experimented on MATLAB (2018a) and validated by different performance metrics such as energy, alive nodes, BS position, and packet delivery ratio. The obtained results of the proposed algorithm exhibit better outcome in terms of more alive nodes per round, maximum number of packets delivery to the BS, improved residual energy and enhanced lifetime. At last, the proposed algorithm has achieved a better lifetime of ≈20%, ≈30% and ≈45% compared to grey wolf optimization (GWO), Artificial bee colony (ABC) and Low-energy adaptive clustering hierarchy (LEACH) techniques

    Routing Protocol for MANET Based on QoS-Aware Service Composition with Dynamic Secured Broker Selection

    No full text
    MANET is a mobile ad hoc network with many mobile nodes communicating without a centralized module. Infrastructure-less networks make it desirable for many researchers to publish and bind multimedia services. Each node in this infrastructure-less network acts as self-organizing and re-configurable. It allows services to deploy and attain from another node over the ad hoc network. The service composition aims to provide a user’s requirement by combining different atomic services based on non-functional QoS parameters such as reliability, availability, scalability, etc. To provide service composition in MANET is challenging because of the node mobility, link failure, and topology changes, so a traditional protocol will be sufficient to obtain real-time services from mobile nodes. In this paper, the ad hoc on-demand distance vector protocol (AODV) is used and analyzed based on MANET’s QoS (Quality of Service) metrics. The QoS metrics for MANET depends on delay, bandwidth, memory capacity, network load, and packet drop. The requester node and provider node broker acts as a composer for this MANET network. The authors propose a QoS-based Dynamic Secured Broker Selection architecture (QoSDSBS) for service composition in MANET, which uses a dynamic broker and provides a secure path selection based on QoS metrics. The proposed algorithm is simulated using Network Simulator (NS2) with 53 intermediate nodes and 35 mobile nodes of area 1000 m × 1000 m. The comparative results show that the proposed architecture outperforms, with standards, the AODV protocol and affords higher scalability and a reduced network load

    Developing a Speech Recognition System for Recognizing Tonal Speech Signals Using a Convolutional Neural Network

    No full text
    Deep learning-based machine learning models have shown significant results in speech recognition and numerous vision-related tasks. The performance of the present speech-to-text model relies upon the hyperparameters used in this research work. In this research work, it is shown that convolutional neural networks (CNNs) can model raw and tonal speech signals. Their performance is on par with existing recognition systems. This study extends the role of the CNN-based approach to robust and uncommon speech signals (tonal) using its own designed database for target research. The main objective of this research work was to develop a speech-to-text recognition system to recognize the tonal speech signals of Gurbani hymns using a CNN. Further, the CNN model, with six layers of 2DConv, 2DMax Pooling, and 256 dense layer units (Google’s TensorFlow service) was also used in this work, as well as Praat for speech segmentation. Feature extraction was enforced using the MFCC feature extraction technique, which extracts standard speech features and features of background music as well. Our study reveals that the CNN-based method for identifying tonal speech sentences and adding instrumental knowledge performs better than the existing and conventional approaches. The experimental results demonstrate the significant performance of the present CNN architecture by providing an 89.15% accuracy rate and a 10.56% WER for continuous and extensive vocabulary sentences of speech signals with different tones
    corecore